-Factorization of the symmetric digraph of wreath product of graphs
نویسندگان
چکیده
In this paper, we show that the necessary and sufficient condition for the existence of an e Sk-factorization of (Cm ◦ Kn)∗ is n ≡ 0 (mod k(k − 1)), for all m > 3. In fact, our result together with a result of Ushio gives a complete solution for the existence of an e Sk-factorization of (Cm ◦Kn)∗ for all m ≥ 3. Further, we have obtained some necessary or sufficient conditions for the existence of an e Sk-factorization of K ∗ n1,n2,...,nm , for all even k ≥ 4 and m > 3.
منابع مشابه
Isomorphic factorization, the Kronecker product and the line digraph
In this paper, we investigate isomorphic factorizations of the Kronecker product graphs. Using these relations, it is shown that (1) the Kronecker product of the d-out-regular digraph and the complete symmetric digraph is factorized into the line digraph, (2) the Kronecker product of the Kautz digraph and the de Bruijn digraph is factorized into the Kautz digraph, (3) the Kronecker product of b...
متن کاملAutomorphism Groups of Wreath Product Digraphs
We strengthen a classical result of Sabidussi giving a necessary and sufficient condition on two graphs, X and Y , for the automorphsim group of the wreath product of the graphs, Aut(X o Y ) to be the wreath product of the automorphism groups Aut(X) o Aut(Y ). We also generalize this to arrive at a similar condition on color digraphs. The main purpose of this paper is to revisit a well-known an...
متن کاملFix-euler-mahonian Statistics on Wreath Products
In 1997 Clarke, Han, and Zeng introduced a q-analogue of Euler’s difference table for n! using a key bijection Ψ on symmetric groups. In this paper we extend their results to the wreath product of a cyclic group with the symmetric group. By generalizing their bijection Ψ we prove the equidistribution of the triple statistics (fix, exc, fmaj) and (fix, exc, fmaf) on wreath products, where “fix”,...
متن کاملBipartite Symmetric Digraph
P2p -factorization of a complete bipartite graph for p, an integer was studied by Wang [1]. Further, Beiling [2] extended the work of Wang[1], and studied the P2k -factorization of complete bipartite multigraphs. For even value of k in Pk -factorization the spectrum problem is completely solved [1, 2, 3]. However for odd value of k i.e. P3 , P5 and P7 , the path factorization have been studied ...
متن کاملDihedral Butterfly Digraph and Its Cayley Graph Representation
In this paper, we present a new extension of the butterfly digraph, which is known as one of the topologies used for interconnection networks. The butterfly digraph was previously generalized from binary to d-ary. We define a new digraph by adding a signed label to each vertex of the d-ary butterfly digraph. We call this digraph the dihedral butterfly digraph and study its properties. Furthermo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Math., Alg. and Appl.
دوره 6 شماره
صفحات -
تاریخ انتشار 2014